The robust min-max newsvendor problem with balking under a service level constraint
نویسندگان
چکیده
منابع مشابه
Min-max distribution free continuous-review model with a service level constraint and variable lead time
In this paper, we provide a continuous-review (Q, r, L) inventory model with a fill rate service constraint and a negative exponential crashing cost function with a variable lead time. Tajbakhsh [1] developed a closed-form solution that considered an order quantity and a reorder point. We extend the distribution free continuous-review inventory model to minimize the total cost by using a negati...
متن کاملMin-max-min robust combinatorial optimization
The idea of k-adaptability in two-stage robust optimization is to calculate a fixed number k of second-stage policies here-and-now. After the actual scenario is revealed, the best of these policies is selected. This idea leads to a min-max-min problem. In this paper, we consider the case where no first stage variables exist and propose to use this approach to solve combinatorial optimization pr...
متن کاملMin-max Bias Robust Regression
This the problem maximum asymptotic bias of regression estimates over a-contamination for the joint of the response carriers. Two classes of estimates are treated: (1) Msestimates with bounded function p applied to the scaled residuals, using a very general class of scale estimates, and (2) Bounded influence function type generalized M-estimates. Estimates in the first class are oblta1rled as p...
متن کاملThe Min-max Edge q-Coloring Problem
In this paper we introduce and study a new problem named min-max edge q-coloring which is motivated by applications in wireless mesh networks. The input of the problem consists of an undirected graph and an integer q. The goal is to color the edges of the graph with as many colors as possible such that: (a) any vertex is incident to at most q different colors, and (b) the maximum size of a colo...
متن کاملOn the max min vertex cover Problem
We address the max min vertex cover problem, which is the maximization version of the well studied min independent dominating set problem, known to be NP-hard and highly inapproximable in polynomial time. We present tight approximation results for this problem on general graphs, namely a polynomial approximation algorithm which guarantees an n approximation ratio, while showing that unless P = ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The South African Journal of Industrial Engineering
سال: 2013
ISSN: 2224-7890
DOI: 10.7166/24-3-600